Evaluation of Optimization Strategies for Incremental Graph Queries
نویسندگان
چکیده
منابع مشابه
Incremental View Maintenance for Property Graph Queries
Graph processing challenges are common in modern database systems, with the property graph data model gaining widespread adoption [29]. Due to the novelty of the eld, graph databases and frameworks typically provide their own query language, such as Cypher for Neo4j [27], Gremlin for TinkerPop [28] and GraphScript for SAP HANA [24]. These languages often lack a formal background for their data ...
متن کاملROSIE: Runtime Optimization of SPARQL Queries Using Incremental Evaluation
Relational databases are wildly adopted in RDF (Resource Description Framework) data management. For efficient SPARQL query evaluation, the legacy query optimizer needs reconsiderations. One vital problem is how to tackle the suboptimal query plan caused by error-prone cardinality estimation. Consider the schema-free nature of RDF data and the Join-intensive characteristic of SPARQL query, dete...
متن کاملOptimization of Incremental Queries in the Cloud
Database and model queries are the foundations of data-driven applications. Their performance is of primary importance in model-driven software engineering (MDE), especially with the evergrowing complexity of software modeling projects. To address the scalability issues of traditional MDE tools, distributed frameworks are being developed – however, query optimization in a distributed context br...
متن کاملEecient Incremental Evaluation of Queries with Aggregation
We present a technique for eeciently evaluating queries on programs with mono-tonic aggregation, a class of programs deened by Ross and Sagiv. Our technique consists of the following components: incremental computation of aggregate functions , incremental xpoint evaluation of monotonic programs and Magic Sets transformation of monotonic programs. We also present a formalization of the notion of...
متن کاملEfficient Incremental Evaluation of Queries with Aggregation
We present a technique for eeciently evaluating queries on programs with mono-tonic aggregation, a class of programs deened by Ross and Sagiv. Our technique consists of the following components: incremental computation of aggregate functions , incremental xpoint evaluation of monotonic programs and Magic Sets transformation of monotonic programs. We also present a formalization of the notion of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Periodica Polytechnica Electrical Engineering and Computer Science
سال: 2017
ISSN: 2064-5279,2064-5260
DOI: 10.3311/ppee.9769